Characterising random partitions by random colouring
نویسندگان
چکیده
منابع مشابه
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...
متن کاملRandomly colouring random graphs
We consider the problem of generating a colouring of the random graph Gn,p uniformly at random using a natural Markov chain algorithm: the Glauber dynamics. We assume that there are β∆ colours available, where ∆ is the maximum degree of the graph, and we wish to determine the least β = β(p) such that the distribution is close to uniform in O(n log n) steps of the chain. This problem has been pr...
متن کاملColouring random geometric graphs
A random geometric graph Gn is obtained as follows. We takeX1, X2, . . . , Xn ∈ R at random (i.i.d. according to some probability distribution ν on R). For i 6= j we joinXi andXj by an edge if ‖Xi−Xj ‖< r(n). We study the properties of the chromatic number χn and clique number ωn of this graph as n becomes large, where we assume that r(n) → 0. We allow any choice ν that has a bounded density fu...
متن کاملColouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular graph. The analysis includes use of the differential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-r...
متن کاملIncrements of Random Partitions
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 ≤ i ≤ n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2020
ISSN: 1083-589X
DOI: 10.1214/19-ecp283